LEARNING LARGE-ALPHABET AND ANALOG CIRCUITS WITH VALUE INJECTION QUERIES Dana Angluin1 James Aspnes1 Jiang Chen2

Source URL: www.levreyzin.com

• Computational complexity theory
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Complexity classes
• Clique problem
• Boolean circuit
• ACC0
• Clique
• Circuit
• NC

Dana Angluin1, James Aspnes1, Jiang Chen2, David Eisenstat, Lev Reyzin1 1Yale University 2Yahoo! Inc. COLT 2008

Source URL: www.levreyzin.com

• Computational complexity theory
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Complexity classes
• Boolean circuit
• NC
• PP
• ACC0
• Circuit
• FO

Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,

Source URL: yices.csl.sri.com

• Computational complexity theory
• Theoretical computer science
• Theory of computation
• Logic in computer science
• Formal methods
• Boolean algebra
• Complexity classes
• Electronic design automation
• Satisfiability modulo theories
• True quantified Boolean formula
• FO
• NC

On Symmetric Circuits and FPC Anuj Dawar University of Cambridge Computer Laboratory joint work with Matthew Anderson

Source URL: highlights-conference.org

• Complexity classes
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Computational complexity theory
• Computer science
• Boolean circuit
• Logic in computer science
• NC
• P
• Circuit
• FO

Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability Anton Belov1⋆ and Matti J¨arvisalo2⋆⋆ 1 Complex and Adaptive Systems Laboratory, University College Dublin, Ireland

Source URL: anton.belov-mcdowell.com

EXTENSIONAL UNIFORMITY FOR BOOLEAN CIRCUITS† PIERRE MCKENZIE‡ , MICHAEL THOMAS§ , AND HERIBERT VOLLMER§ Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simpl

Source URL: www.thi.uni-hannover.de

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE Globecom 2010 proceedings. Privacy Preserving Group Nearest Neighbour Queries in

Source URL: www.cse.unt.edu

• Peer-to-peer
• Internet privacy
• Scalability
• Database
• Secure multi-party computation
• Boolean circuit
• Theoretical computer science
• Computing
• Applied mathematics

BRICS RS-05-9 Frandsen & Miltersen: Reviewing Bounds on the Circuit Size of the Hardest Functions BRICS Basic Research in Computer Science

Source URL: www.brics.dk

• Circuit complexity
• Complexity classes
• Mathematical notation
• Computational complexity theory
• Stack
• Boolean circuit
• Summation
• NC
• ACC0
• Theoretical computer science
• Mathematics
• Applied mathematics

2013 IEEE Symposium on Security and Privacy Circuit Structures for Improving Efficiency of Security and Privacy Tools Samee Zahur and David Evans University of Virginia [samee, evans]@virginia.edu

Source URL: www.ieee-security.org

• Abstract data types
• Electronic engineering
• Stack
• Computational complexity theory
• Circuit
• Electronic circuit
• Secure multi-party computation
• Boolean circuit
• Lookup table
• Computing
• Theoretical computer science
• Electronics

Chapter 1 Introduction Let f be Boolean function from nite binary strings to the set f0; 1g. The basic question of complexity theory is what computational resources are needed to compute f (x) for an arbitrary n-bit str

Source URL: www.nada.kth.se

• Circuit complexity
• Complexity classes
• Parity function
• ACC0
• Switching lemma
• NC
• Clique problem
• Boolean circuit
• Circuit
• Theoretical computer science
• Computational complexity theory
• Applied mathematics